Integer Linear Programming model for Reconfigurable Routing Problem in a Network-on-Chip with Guaranteed Traffic

We define an integer linear programming model of combinatorial optimization problem that models reconfigurable multipath routing in a Network-on-Chip with guaranteed traffic. Based on time division multiplexing, the model allows avoiding collisions, deadlocks and livelocks in irregular network topologies, while minimizing latency. The model allows dynamic reconfigurable routing. In that case, independent sets of valid routes are pre-computed in such a way they can be interchanged with no impact on the existing traffic, while reusing all the vacant time-slot resources.